80 research outputs found
Variable binding, symmetric monoidal closed theories, and bigraphs
This paper investigates the use of symmetric monoidal closed (SMC) structure
for representing syntax with variable binding, in particular for languages with
linear aspects. In our setting, one first specifies an SMC theory T, which may
express binding operations, in a way reminiscent from higher-order abstract
syntax. This theory generates an SMC category S(T) whose morphisms are, in a
sense, terms in the desired syntax. We apply our approach to Jensen and
Milner's (abstract binding) bigraphs, which are linear w.r.t. processes. This
leads to an alternative category of bigraphs, which we compare to the original.Comment: An introduction to two more technical previous preprints. Accepted at
Concur '0
Graphical Encoding of a Spatial Logic for the pi-Calculus
This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the denotation is fully abstract with respect to the usual structural congruence, i.e., two processes are equivalent exactly when the corresponding encodings yield isomorphic graphs. Behavioral and structural properties of π-calculus processes expressed in a spatial logic can then be verified on the graphical encoding of a process rather than on its textual representation. In this paper we introduce a modal logic for graphs and define a translation of spatial formulae such that a process verifies a spatial formula exactly when its graphical representation verifies the translated modal graph formula
A Longitudinal study of motor ability and kinaesthetic acuity in young children at risk of developmental coordination disorder
Contains fulltext :
147308.pdf (publisher's version ) (Closed access
Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes
Contains fulltext :
143746.pdf (publisher's version ) (Open Access)CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, September 7-10, Berlin, German
Game semantics for nominal exceptions
We present a fully abstract denotational model for a higher-order programming language combining call-by-value evaluation and local exceptions. The model is built using nominal game semantics and is the first one to achieve both effective presentability and freedom from “bad exception” constructs
- …